Visualizing Mutually Nondominating Solution Sets in Many-Objective Optimization
نویسندگان
چکیده
منابع مشابه
Multi-objective Optimization with Unbounded Solution Sets
Machine learning often requires the optimization of multiple, partially conflicting objectives. True multi-objective optimization (MOO) methods avoid the need to choose a weighting of the objectives a priori and provide insights about the tradeoffs between the objectives. We extend a state-of-the-art derivative-free Monte Carlo method for MOO, the MO-CMA-ES, to operate on an unbounded set of (n...
متن کاملVisualizing Parametric Solution Sets
We characterize the boundary ∂Σ of the solution set Σ of a parametric linear system A(p)x = b(p) where the elements of the n×n matrix and the right-hand side vector depend on a number of parameters p varying within interval bounds. The characterization of ∂Σ is by means of pieces of parametric hypersurfaces, the latter represented by their coordinate functions depending on corresponding subsets...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Effective ranking + speciation = Many-objective optimization
Multiobjective optimization problems have been widely addressed using evolutionary computation techniques. However, when dealing with more than three conflicting objectives (the so-called many-objective problems), the performance of such approaches deteriorates. The problem lies in the inability of Pareto dominance to provide an effective discrimination. Alternative ranking methods have been su...
متن کاملMany objective optimization and hypervolume based search
Multiobjective optimization problems occur frequently in practice where multiple objectives have to be optimized simultaneously and the goal is to find or approximate the set of Pareto-optimal solutions. Multiobjective evolutionary algorithms (MOEAs) are one type of randomized search heuristics that are well-suited for multiobjective optimization problems due to their ability of computing a set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2013
ISSN: 1089-778X,1089-778X,1941-0026
DOI: 10.1109/tevc.2012.2225064